Clustering decomposed belief functions using generalized weights of conflict
نویسندگان
چکیده
منابع مشابه
Clustering decomposed belief functions using generalized weights of conflict
We develop a method for clustering all types of belief functions, in particular non-consonant belief functions. Such clustering is done when the belief functions concern multiple events, and all belief functions are mixed up. Clustering is performed by decomposing all belief functions into simple support and inverse simple support functions that are clustered based on their pairwise generalized...
متن کاملManaging decomposed belief functions
In this paper we develop a method for clustering all types of belief functions, in particular nonconsonant belief functions. Such clustering is done when the belief functions concern multiple events, and all belief functions are mixed up. Clustering is performed by decomposing all belief functions into simple support and inverse simple support functions that are clustered based on their pairwis...
متن کاملClustering interval-valued proximity data using belief functions
The problem of clustering objects based on interval-valued dissimilarities is tackled in the framework of the Dempster-Shafer theory of belief functions. The proposed method assigns to each object a basic belief assignment (or mass function) defined on the set of clusters, in such a way that the belief and the plausibility that any two objects belong to the same cluster reflect, respectively, t...
متن کاملWeights of Evidence and Internal Conflict for Support Functions
Shafer [1] defined weights of evidence and the weight of internal conflict for separable support functions. He also formulated a conjecture, the weight-ofconflict conjecture, which implies that these definitions can be extended in a natural way to all support functions. In this paper I show that the extension to support functions can be carried out whether or not the weight-of-conflict conjectu...
متن کاملEnsemble clustering in the belief functions framework
In this paper, belief functions, defined on the lattice of intervals partitions of a set of objects, are investigated as a suitable framework for combining multiple clusterings. We first show how to represent clustering results as masses of evidence allocated to sets of partitions. Then a consensus belief function is obtained using a suitable combination rule. Tools for synthesizing the results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2008
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2007.03.002